| 1. | This way, it will never occur in any bit position in any encoded data stream.
|
| 2. | Switch Word commands were used to move some bits in the word to other bit positions.
|
| 3. | The phase-modulated time code therefore avoids using these bit positions within the minute for important information.
|
| 4. | Let p be the lowest bit position in the binary representation of d that has a 1 digit.
|
| 5. | Here, the weights assigned to the bit positions are 7-4-2-1-0.
|
| 6. | This is a system of binary counting in which any two adjacent codes differ by only one bit position.
|
| 7. | The second diagram ( shown to the right ) is identical but, instead, the bit positions are marked.
|
| 8. | To compare two images, construct the hash from each image and count the number of bit positions that are different.
|
| 9. | The ASCII " N " and " P " characters differ in four bit positions, providing excellent protection from single punch errors.
|
| 10. | If a simple shifter were used, shifting by " n " bit positions would require " n " clock cycles.
|